The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(1, n^1).

0 CpxTRS
↳1 NestedDefinedSymbolProof (BOTH BOUNDS(ID, ID), 0 ms)
↳2 CpxTRS
    ↳3 CpxTrsMatchBoundsTAProof (⇔, 50 ms)
    ↳4 BOUNDS(1, n^1)
    ↳5 CpxTrsToCdtProof (BOTH BOUNDS(ID, ID), 18 ms)
    ↳6 CdtProblem
        ↳7 CdtLeafRemovalProof (BOTH BOUNDS(ID, ID), 0 ms)
        ↳8 CdtProblem
        ↳9 CdtRhsSimplificationProcessorProof (BOTH BOUNDS(ID, ID), 0 ms)
        ↳10 CdtProblem
        ↳11 CdtUsableRulesProof (⇔, 0 ms)
        ↳12 CdtProblem
        ↳13 CdtRuleRemovalProof (UPPER BOUND(ADD(n^2)), 177 ms)
        ↳14 CdtProblem
        ↳15 CdtRuleRemovalProof (UPPER BOUND(ADD(n^1)), 30 ms)
        ↳16 CdtProblem
        ↳17 CdtRuleRemovalProof (UPPER BOUND(ADD(n^1)), 36 ms)
        ↳18 CdtProblem
        ↳19 CdtRuleRemovalProof (UPPER BOUND(ADD(n^1)), 0 ms)
        ↳20 CdtProblem
        ↳21 CdtRuleRemovalProof (UPPER BOUND(ADD(n^1)), 1 ms)
        ↳22 CdtProblem
        ↳23 CdtRuleRemovalProof (UPPER BOUND(ADD(n^1)), 21 ms)
        ↳24 CdtProblem
        ↳25 CdtRuleRemovalProof (UPPER BOUND(ADD(n^1)), 0 ms)
        ↳26 CdtProblem
        ↳27 CdtRuleRemovalProof (UPPER BOUND(ADD(n^1)), 8 ms)
        ↳28 CdtProblem
        ↳29 CdtRuleRemovalProof (UPPER BOUND(ADD(n^1)), 21 ms)
        ↳30 CdtProblem
        ↳31 SIsEmptyProof (BOTH BOUNDS(ID, ID), 0 ms)
        ↳32 BOUNDS(1, 1)

(0) Obligation:

The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(1, n^1).


The TRS R consists of the following rules:

active(from(X)) → mark(cons(X, from(s(X))))
active(first(0, Z)) → mark(nil)
active(first(s(X), cons(Y, Z))) → mark(cons(Y, first(X, Z)))
active(sel(0, cons(X, Z))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(from(X)) → from(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(s(X)) → s(active(X))
active(first(X1, X2)) → first(active(X1), X2)
active(first(X1, X2)) → first(X1, active(X2))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
from(mark(X)) → mark(from(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
s(mark(X)) → mark(s(X))
first(mark(X1), X2) → mark(first(X1, X2))
first(X1, mark(X2)) → mark(first(X1, X2))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
proper(from(X)) → from(proper(X))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(first(X1, X2)) → first(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
from(ok(X)) → ok(from(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
s(ok(X)) → ok(s(X))
first(ok(X1), ok(X2)) → ok(first(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Rewrite Strategy: INNERMOST

(1) NestedDefinedSymbolProof (BOTH BOUNDS(ID, ID) transformation)

The following defined symbols can occur below the 0th argument of top: proper, active
The following defined symbols can occur below the 0th argument of proper: proper, active
The following defined symbols can occur below the 0th argument of active: proper, active

Hence, the left-hand sides of the following rules are not basic-reachable and can be removed:
active(from(X)) → mark(cons(X, from(s(X))))
active(first(0, Z)) → mark(nil)
active(first(s(X), cons(Y, Z))) → mark(cons(Y, first(X, Z)))
active(sel(0, cons(X, Z))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(from(X)) → from(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(s(X)) → s(active(X))
active(first(X1, X2)) → first(active(X1), X2)
active(first(X1, X2)) → first(X1, active(X2))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
proper(from(X)) → from(proper(X))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(first(X1, X2)) → first(proper(X1), proper(X2))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))

(2) Obligation:

The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(1, n^1).


The TRS R consists of the following rules:

top(ok(X)) → top(active(X))
proper(nil) → ok(nil)
from(ok(X)) → ok(from(X))
from(mark(X)) → mark(from(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
sel(mark(X1), X2) → mark(sel(X1, X2))
first(ok(X1), ok(X2)) → ok(first(X1, X2))
first(mark(X1), X2) → mark(first(X1, X2))
s(ok(X)) → ok(s(X))
s(mark(X)) → mark(s(X))
proper(0) → ok(0)
first(X1, mark(X2)) → mark(first(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
top(mark(X)) → top(proper(X))

Rewrite Strategy: INNERMOST

(3) CpxTrsMatchBoundsTAProof (EQUIVALENT transformation)

A linear upper bound on the runtime complexity of the TRS R could be shown with a Match-Bound[TAB_LEFTLINEAR,TAB_NONLEFTLINEAR] (for contructor-based start-terms) of 2.

The compatible tree automaton used to show the Match-Boundedness (for constructor-based start-terms) is represented by:
final states : [1, 2, 3, 4, 5, 6, 7]
transitions:
ok0(0) → 0
active0(0) → 0
nil0() → 0
mark0(0) → 0
00() → 0
top0(0) → 1
proper0(0) → 2
from0(0) → 3
cons0(0, 0) → 4
sel0(0, 0) → 5
first0(0, 0) → 6
s0(0) → 7
active1(0) → 8
top1(8) → 1
nil1() → 9
ok1(9) → 2
from1(0) → 10
ok1(10) → 3
from1(0) → 11
mark1(11) → 3
cons1(0, 0) → 12
ok1(12) → 4
sel1(0, 0) → 13
mark1(13) → 5
first1(0, 0) → 14
ok1(14) → 6
first1(0, 0) → 15
mark1(15) → 6
s1(0) → 16
ok1(16) → 7
s1(0) → 17
mark1(17) → 7
01() → 18
ok1(18) → 2
sel1(0, 0) → 19
ok1(19) → 5
cons1(0, 0) → 20
mark1(20) → 4
proper1(0) → 21
top1(21) → 1
ok1(9) → 21
ok1(10) → 10
ok1(10) → 11
mark1(11) → 10
mark1(11) → 11
ok1(12) → 12
ok1(12) → 20
mark1(13) → 13
mark1(13) → 19
ok1(14) → 14
ok1(14) → 15
mark1(15) → 14
mark1(15) → 15
ok1(16) → 16
ok1(16) → 17
mark1(17) → 16
mark1(17) → 17
ok1(18) → 21
ok1(19) → 13
ok1(19) → 19
mark1(20) → 12
mark1(20) → 20
active2(9) → 22
top2(22) → 1
active2(18) → 22

(4) BOUNDS(1, n^1)

(5) CpxTrsToCdtProof (BOTH BOUNDS(ID, ID) transformation)

Converted Cpx (relative) TRS to CDT

(6) Obligation:

Complexity Dependency Tuples Problem
Rules:

top(ok(z0)) → top(active(z0))
top(mark(z0)) → top(proper(z0))
proper(nil) → ok(nil)
proper(0) → ok(0)
from(ok(z0)) → ok(from(z0))
from(mark(z0)) → mark(from(z0))
cons(ok(z0), ok(z1)) → ok(cons(z0, z1))
cons(mark(z0), z1) → mark(cons(z0, z1))
sel(mark(z0), z1) → mark(sel(z0, z1))
sel(ok(z0), ok(z1)) → ok(sel(z0, z1))
sel(z0, mark(z1)) → mark(sel(z0, z1))
first(ok(z0), ok(z1)) → ok(first(z0, z1))
first(mark(z0), z1) → mark(first(z0, z1))
first(z0, mark(z1)) → mark(first(z0, z1))
s(ok(z0)) → ok(s(z0))
s(mark(z0)) → mark(s(z0))
Tuples:

TOP(ok(z0)) → c(TOP(active(z0)))
TOP(mark(z0)) → c1(TOP(proper(z0)), PROPER(z0))
PROPER(nil) → c2
PROPER(0) → c3
FROM(ok(z0)) → c4(FROM(z0))
FROM(mark(z0)) → c5(FROM(z0))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
FIRST(ok(z0), ok(z1)) → c11(FIRST(z0, z1))
FIRST(mark(z0), z1) → c12(FIRST(z0, z1))
FIRST(z0, mark(z1)) → c13(FIRST(z0, z1))
S(ok(z0)) → c14(S(z0))
S(mark(z0)) → c15(S(z0))
S tuples:

TOP(ok(z0)) → c(TOP(active(z0)))
TOP(mark(z0)) → c1(TOP(proper(z0)), PROPER(z0))
PROPER(nil) → c2
PROPER(0) → c3
FROM(ok(z0)) → c4(FROM(z0))
FROM(mark(z0)) → c5(FROM(z0))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
FIRST(ok(z0), ok(z1)) → c11(FIRST(z0, z1))
FIRST(mark(z0), z1) → c12(FIRST(z0, z1))
FIRST(z0, mark(z1)) → c13(FIRST(z0, z1))
S(ok(z0)) → c14(S(z0))
S(mark(z0)) → c15(S(z0))
K tuples:none
Defined Rule Symbols:

top, proper, from, cons, sel, first, s

Defined Pair Symbols:

TOP, PROPER, FROM, CONS, SEL, FIRST, S

Compound Symbols:

c, c1, c2, c3, c4, c5, c6, c7, c8, c9, c10, c11, c12, c13, c14, c15

(7) CdtLeafRemovalProof (BOTH BOUNDS(ID, ID) transformation)

Removed 3 trailing nodes:

TOP(ok(z0)) → c(TOP(active(z0)))
PROPER(nil) → c2
PROPER(0) → c3

(8) Obligation:

Complexity Dependency Tuples Problem
Rules:

top(ok(z0)) → top(active(z0))
top(mark(z0)) → top(proper(z0))
proper(nil) → ok(nil)
proper(0) → ok(0)
from(ok(z0)) → ok(from(z0))
from(mark(z0)) → mark(from(z0))
cons(ok(z0), ok(z1)) → ok(cons(z0, z1))
cons(mark(z0), z1) → mark(cons(z0, z1))
sel(mark(z0), z1) → mark(sel(z0, z1))
sel(ok(z0), ok(z1)) → ok(sel(z0, z1))
sel(z0, mark(z1)) → mark(sel(z0, z1))
first(ok(z0), ok(z1)) → ok(first(z0, z1))
first(mark(z0), z1) → mark(first(z0, z1))
first(z0, mark(z1)) → mark(first(z0, z1))
s(ok(z0)) → ok(s(z0))
s(mark(z0)) → mark(s(z0))
Tuples:

TOP(mark(z0)) → c1(TOP(proper(z0)), PROPER(z0))
FROM(ok(z0)) → c4(FROM(z0))
FROM(mark(z0)) → c5(FROM(z0))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
FIRST(ok(z0), ok(z1)) → c11(FIRST(z0, z1))
FIRST(mark(z0), z1) → c12(FIRST(z0, z1))
FIRST(z0, mark(z1)) → c13(FIRST(z0, z1))
S(ok(z0)) → c14(S(z0))
S(mark(z0)) → c15(S(z0))
S tuples:

TOP(mark(z0)) → c1(TOP(proper(z0)), PROPER(z0))
FROM(ok(z0)) → c4(FROM(z0))
FROM(mark(z0)) → c5(FROM(z0))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
FIRST(ok(z0), ok(z1)) → c11(FIRST(z0, z1))
FIRST(mark(z0), z1) → c12(FIRST(z0, z1))
FIRST(z0, mark(z1)) → c13(FIRST(z0, z1))
S(ok(z0)) → c14(S(z0))
S(mark(z0)) → c15(S(z0))
K tuples:none
Defined Rule Symbols:

top, proper, from, cons, sel, first, s

Defined Pair Symbols:

TOP, FROM, CONS, SEL, FIRST, S

Compound Symbols:

c1, c4, c5, c6, c7, c8, c9, c10, c11, c12, c13, c14, c15

(9) CdtRhsSimplificationProcessorProof (BOTH BOUNDS(ID, ID) transformation)

Removed 1 trailing tuple parts

(10) Obligation:

Complexity Dependency Tuples Problem
Rules:

top(ok(z0)) → top(active(z0))
top(mark(z0)) → top(proper(z0))
proper(nil) → ok(nil)
proper(0) → ok(0)
from(ok(z0)) → ok(from(z0))
from(mark(z0)) → mark(from(z0))
cons(ok(z0), ok(z1)) → ok(cons(z0, z1))
cons(mark(z0), z1) → mark(cons(z0, z1))
sel(mark(z0), z1) → mark(sel(z0, z1))
sel(ok(z0), ok(z1)) → ok(sel(z0, z1))
sel(z0, mark(z1)) → mark(sel(z0, z1))
first(ok(z0), ok(z1)) → ok(first(z0, z1))
first(mark(z0), z1) → mark(first(z0, z1))
first(z0, mark(z1)) → mark(first(z0, z1))
s(ok(z0)) → ok(s(z0))
s(mark(z0)) → mark(s(z0))
Tuples:

FROM(ok(z0)) → c4(FROM(z0))
FROM(mark(z0)) → c5(FROM(z0))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
FIRST(ok(z0), ok(z1)) → c11(FIRST(z0, z1))
FIRST(mark(z0), z1) → c12(FIRST(z0, z1))
FIRST(z0, mark(z1)) → c13(FIRST(z0, z1))
S(ok(z0)) → c14(S(z0))
S(mark(z0)) → c15(S(z0))
TOP(mark(z0)) → c1(TOP(proper(z0)))
S tuples:

FROM(ok(z0)) → c4(FROM(z0))
FROM(mark(z0)) → c5(FROM(z0))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
FIRST(ok(z0), ok(z1)) → c11(FIRST(z0, z1))
FIRST(mark(z0), z1) → c12(FIRST(z0, z1))
FIRST(z0, mark(z1)) → c13(FIRST(z0, z1))
S(ok(z0)) → c14(S(z0))
S(mark(z0)) → c15(S(z0))
TOP(mark(z0)) → c1(TOP(proper(z0)))
K tuples:none
Defined Rule Symbols:

top, proper, from, cons, sel, first, s

Defined Pair Symbols:

FROM, CONS, SEL, FIRST, S, TOP

Compound Symbols:

c4, c5, c6, c7, c8, c9, c10, c11, c12, c13, c14, c15, c1

(11) CdtUsableRulesProof (EQUIVALENT transformation)

The following rules are not usable and were removed:

top(ok(z0)) → top(active(z0))
top(mark(z0)) → top(proper(z0))
from(ok(z0)) → ok(from(z0))
from(mark(z0)) → mark(from(z0))
cons(ok(z0), ok(z1)) → ok(cons(z0, z1))
cons(mark(z0), z1) → mark(cons(z0, z1))
sel(mark(z0), z1) → mark(sel(z0, z1))
sel(ok(z0), ok(z1)) → ok(sel(z0, z1))
sel(z0, mark(z1)) → mark(sel(z0, z1))
first(ok(z0), ok(z1)) → ok(first(z0, z1))
first(mark(z0), z1) → mark(first(z0, z1))
first(z0, mark(z1)) → mark(first(z0, z1))
s(ok(z0)) → ok(s(z0))
s(mark(z0)) → mark(s(z0))

(12) Obligation:

Complexity Dependency Tuples Problem
Rules:

proper(nil) → ok(nil)
proper(0) → ok(0)
Tuples:

FROM(ok(z0)) → c4(FROM(z0))
FROM(mark(z0)) → c5(FROM(z0))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
FIRST(ok(z0), ok(z1)) → c11(FIRST(z0, z1))
FIRST(mark(z0), z1) → c12(FIRST(z0, z1))
FIRST(z0, mark(z1)) → c13(FIRST(z0, z1))
S(ok(z0)) → c14(S(z0))
S(mark(z0)) → c15(S(z0))
TOP(mark(z0)) → c1(TOP(proper(z0)))
S tuples:

FROM(ok(z0)) → c4(FROM(z0))
FROM(mark(z0)) → c5(FROM(z0))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
FIRST(ok(z0), ok(z1)) → c11(FIRST(z0, z1))
FIRST(mark(z0), z1) → c12(FIRST(z0, z1))
FIRST(z0, mark(z1)) → c13(FIRST(z0, z1))
S(ok(z0)) → c14(S(z0))
S(mark(z0)) → c15(S(z0))
TOP(mark(z0)) → c1(TOP(proper(z0)))
K tuples:none
Defined Rule Symbols:

proper

Defined Pair Symbols:

FROM, CONS, SEL, FIRST, S, TOP

Compound Symbols:

c4, c5, c6, c7, c8, c9, c10, c11, c12, c13, c14, c15, c1

(13) CdtRuleRemovalProof (UPPER BOUND(ADD(n^2)) transformation)

Found a reduction pair which oriented the following tuples strictly. Hence they can be removed from S.

FIRST(ok(z0), ok(z1)) → c11(FIRST(z0, z1))
S(ok(z0)) → c14(S(z0))
We considered the (Usable) Rules:none
And the Tuples:

FROM(ok(z0)) → c4(FROM(z0))
FROM(mark(z0)) → c5(FROM(z0))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
FIRST(ok(z0), ok(z1)) → c11(FIRST(z0, z1))
FIRST(mark(z0), z1) → c12(FIRST(z0, z1))
FIRST(z0, mark(z1)) → c13(FIRST(z0, z1))
S(ok(z0)) → c14(S(z0))
S(mark(z0)) → c15(S(z0))
TOP(mark(z0)) → c1(TOP(proper(z0)))
The order we found is given by the following interpretation:
Polynomial interpretation :

POL(0) = [1]   
POL(CONS(x1, x2)) = 0   
POL(FIRST(x1, x2)) = [2]x22 + [2]x12   
POL(FROM(x1)) = 0   
POL(S(x1)) = [2]x12   
POL(SEL(x1, x2)) = 0   
POL(TOP(x1)) = 0   
POL(c1(x1)) = x1   
POL(c10(x1)) = x1   
POL(c11(x1)) = x1   
POL(c12(x1)) = x1   
POL(c13(x1)) = x1   
POL(c14(x1)) = x1   
POL(c15(x1)) = x1   
POL(c4(x1)) = x1   
POL(c5(x1)) = x1   
POL(c6(x1)) = x1   
POL(c7(x1)) = x1   
POL(c8(x1)) = x1   
POL(c9(x1)) = x1   
POL(mark(x1)) = x1   
POL(nil) = 0   
POL(ok(x1)) = [1] + x1   
POL(proper(x1)) = 0   

(14) Obligation:

Complexity Dependency Tuples Problem
Rules:

proper(nil) → ok(nil)
proper(0) → ok(0)
Tuples:

FROM(ok(z0)) → c4(FROM(z0))
FROM(mark(z0)) → c5(FROM(z0))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
FIRST(ok(z0), ok(z1)) → c11(FIRST(z0, z1))
FIRST(mark(z0), z1) → c12(FIRST(z0, z1))
FIRST(z0, mark(z1)) → c13(FIRST(z0, z1))
S(ok(z0)) → c14(S(z0))
S(mark(z0)) → c15(S(z0))
TOP(mark(z0)) → c1(TOP(proper(z0)))
S tuples:

FROM(ok(z0)) → c4(FROM(z0))
FROM(mark(z0)) → c5(FROM(z0))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
FIRST(mark(z0), z1) → c12(FIRST(z0, z1))
FIRST(z0, mark(z1)) → c13(FIRST(z0, z1))
S(mark(z0)) → c15(S(z0))
TOP(mark(z0)) → c1(TOP(proper(z0)))
K tuples:

FIRST(ok(z0), ok(z1)) → c11(FIRST(z0, z1))
S(ok(z0)) → c14(S(z0))
Defined Rule Symbols:

proper

Defined Pair Symbols:

FROM, CONS, SEL, FIRST, S, TOP

Compound Symbols:

c4, c5, c6, c7, c8, c9, c10, c11, c12, c13, c14, c15, c1

(15) CdtRuleRemovalProof (UPPER BOUND(ADD(n^1)) transformation)

Found a reduction pair which oriented the following tuples strictly. Hence they can be removed from S.

SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
We considered the (Usable) Rules:

proper(nil) → ok(nil)
proper(0) → ok(0)
And the Tuples:

FROM(ok(z0)) → c4(FROM(z0))
FROM(mark(z0)) → c5(FROM(z0))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
FIRST(ok(z0), ok(z1)) → c11(FIRST(z0, z1))
FIRST(mark(z0), z1) → c12(FIRST(z0, z1))
FIRST(z0, mark(z1)) → c13(FIRST(z0, z1))
S(ok(z0)) → c14(S(z0))
S(mark(z0)) → c15(S(z0))
TOP(mark(z0)) → c1(TOP(proper(z0)))
The order we found is given by the following interpretation:
Polynomial interpretation :

POL(0) = 0   
POL(CONS(x1, x2)) = 0   
POL(FIRST(x1, x2)) = 0   
POL(FROM(x1)) = 0   
POL(S(x1)) = 0   
POL(SEL(x1, x2)) = [2]x1   
POL(TOP(x1)) = [2]x1   
POL(c1(x1)) = x1   
POL(c10(x1)) = x1   
POL(c11(x1)) = x1   
POL(c12(x1)) = x1   
POL(c13(x1)) = x1   
POL(c14(x1)) = x1   
POL(c15(x1)) = x1   
POL(c4(x1)) = x1   
POL(c5(x1)) = x1   
POL(c6(x1)) = x1   
POL(c7(x1)) = x1   
POL(c8(x1)) = x1   
POL(c9(x1)) = x1   
POL(mark(x1)) = [2] + x1   
POL(nil) = 0   
POL(ok(x1)) = [1] + x1   
POL(proper(x1)) = [2]   

(16) Obligation:

Complexity Dependency Tuples Problem
Rules:

proper(nil) → ok(nil)
proper(0) → ok(0)
Tuples:

FROM(ok(z0)) → c4(FROM(z0))
FROM(mark(z0)) → c5(FROM(z0))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
FIRST(ok(z0), ok(z1)) → c11(FIRST(z0, z1))
FIRST(mark(z0), z1) → c12(FIRST(z0, z1))
FIRST(z0, mark(z1)) → c13(FIRST(z0, z1))
S(ok(z0)) → c14(S(z0))
S(mark(z0)) → c15(S(z0))
TOP(mark(z0)) → c1(TOP(proper(z0)))
S tuples:

FROM(ok(z0)) → c4(FROM(z0))
FROM(mark(z0)) → c5(FROM(z0))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
FIRST(mark(z0), z1) → c12(FIRST(z0, z1))
FIRST(z0, mark(z1)) → c13(FIRST(z0, z1))
S(mark(z0)) → c15(S(z0))
TOP(mark(z0)) → c1(TOP(proper(z0)))
K tuples:

FIRST(ok(z0), ok(z1)) → c11(FIRST(z0, z1))
S(ok(z0)) → c14(S(z0))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
Defined Rule Symbols:

proper

Defined Pair Symbols:

FROM, CONS, SEL, FIRST, S, TOP

Compound Symbols:

c4, c5, c6, c7, c8, c9, c10, c11, c12, c13, c14, c15, c1

(17) CdtRuleRemovalProof (UPPER BOUND(ADD(n^1)) transformation)

Found a reduction pair which oriented the following tuples strictly. Hence they can be removed from S.

TOP(mark(z0)) → c1(TOP(proper(z0)))
We considered the (Usable) Rules:

proper(nil) → ok(nil)
proper(0) → ok(0)
And the Tuples:

FROM(ok(z0)) → c4(FROM(z0))
FROM(mark(z0)) → c5(FROM(z0))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
FIRST(ok(z0), ok(z1)) → c11(FIRST(z0, z1))
FIRST(mark(z0), z1) → c12(FIRST(z0, z1))
FIRST(z0, mark(z1)) → c13(FIRST(z0, z1))
S(ok(z0)) → c14(S(z0))
S(mark(z0)) → c15(S(z0))
TOP(mark(z0)) → c1(TOP(proper(z0)))
The order we found is given by the following interpretation:
Polynomial interpretation :

POL(0) = 0   
POL(CONS(x1, x2)) = 0   
POL(FIRST(x1, x2)) = 0   
POL(FROM(x1)) = 0   
POL(S(x1)) = 0   
POL(SEL(x1, x2)) = 0   
POL(TOP(x1)) = x1   
POL(c1(x1)) = x1   
POL(c10(x1)) = x1   
POL(c11(x1)) = x1   
POL(c12(x1)) = x1   
POL(c13(x1)) = x1   
POL(c14(x1)) = x1   
POL(c15(x1)) = x1   
POL(c4(x1)) = x1   
POL(c5(x1)) = x1   
POL(c6(x1)) = x1   
POL(c7(x1)) = x1   
POL(c8(x1)) = x1   
POL(c9(x1)) = x1   
POL(mark(x1)) = [1] + x1   
POL(nil) = 0   
POL(ok(x1)) = 0   
POL(proper(x1)) = 0   

(18) Obligation:

Complexity Dependency Tuples Problem
Rules:

proper(nil) → ok(nil)
proper(0) → ok(0)
Tuples:

FROM(ok(z0)) → c4(FROM(z0))
FROM(mark(z0)) → c5(FROM(z0))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
FIRST(ok(z0), ok(z1)) → c11(FIRST(z0, z1))
FIRST(mark(z0), z1) → c12(FIRST(z0, z1))
FIRST(z0, mark(z1)) → c13(FIRST(z0, z1))
S(ok(z0)) → c14(S(z0))
S(mark(z0)) → c15(S(z0))
TOP(mark(z0)) → c1(TOP(proper(z0)))
S tuples:

FROM(ok(z0)) → c4(FROM(z0))
FROM(mark(z0)) → c5(FROM(z0))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
FIRST(mark(z0), z1) → c12(FIRST(z0, z1))
FIRST(z0, mark(z1)) → c13(FIRST(z0, z1))
S(mark(z0)) → c15(S(z0))
K tuples:

FIRST(ok(z0), ok(z1)) → c11(FIRST(z0, z1))
S(ok(z0)) → c14(S(z0))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
TOP(mark(z0)) → c1(TOP(proper(z0)))
Defined Rule Symbols:

proper

Defined Pair Symbols:

FROM, CONS, SEL, FIRST, S, TOP

Compound Symbols:

c4, c5, c6, c7, c8, c9, c10, c11, c12, c13, c14, c15, c1

(19) CdtRuleRemovalProof (UPPER BOUND(ADD(n^1)) transformation)

Found a reduction pair which oriented the following tuples strictly. Hence they can be removed from S.

S(mark(z0)) → c15(S(z0))
We considered the (Usable) Rules:none
And the Tuples:

FROM(ok(z0)) → c4(FROM(z0))
FROM(mark(z0)) → c5(FROM(z0))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
FIRST(ok(z0), ok(z1)) → c11(FIRST(z0, z1))
FIRST(mark(z0), z1) → c12(FIRST(z0, z1))
FIRST(z0, mark(z1)) → c13(FIRST(z0, z1))
S(ok(z0)) → c14(S(z0))
S(mark(z0)) → c15(S(z0))
TOP(mark(z0)) → c1(TOP(proper(z0)))
The order we found is given by the following interpretation:
Polynomial interpretation :

POL(0) = [1]   
POL(CONS(x1, x2)) = 0   
POL(FIRST(x1, x2)) = 0   
POL(FROM(x1)) = 0   
POL(S(x1)) = x1   
POL(SEL(x1, x2)) = x1   
POL(TOP(x1)) = 0   
POL(c1(x1)) = x1   
POL(c10(x1)) = x1   
POL(c11(x1)) = x1   
POL(c12(x1)) = x1   
POL(c13(x1)) = x1   
POL(c14(x1)) = x1   
POL(c15(x1)) = x1   
POL(c4(x1)) = x1   
POL(c5(x1)) = x1   
POL(c6(x1)) = x1   
POL(c7(x1)) = x1   
POL(c8(x1)) = x1   
POL(c9(x1)) = x1   
POL(mark(x1)) = [1] + x1   
POL(nil) = [1]   
POL(ok(x1)) = x1   
POL(proper(x1)) = [1] + x1   

(20) Obligation:

Complexity Dependency Tuples Problem
Rules:

proper(nil) → ok(nil)
proper(0) → ok(0)
Tuples:

FROM(ok(z0)) → c4(FROM(z0))
FROM(mark(z0)) → c5(FROM(z0))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
FIRST(ok(z0), ok(z1)) → c11(FIRST(z0, z1))
FIRST(mark(z0), z1) → c12(FIRST(z0, z1))
FIRST(z0, mark(z1)) → c13(FIRST(z0, z1))
S(ok(z0)) → c14(S(z0))
S(mark(z0)) → c15(S(z0))
TOP(mark(z0)) → c1(TOP(proper(z0)))
S tuples:

FROM(ok(z0)) → c4(FROM(z0))
FROM(mark(z0)) → c5(FROM(z0))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
FIRST(mark(z0), z1) → c12(FIRST(z0, z1))
FIRST(z0, mark(z1)) → c13(FIRST(z0, z1))
K tuples:

FIRST(ok(z0), ok(z1)) → c11(FIRST(z0, z1))
S(ok(z0)) → c14(S(z0))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
TOP(mark(z0)) → c1(TOP(proper(z0)))
S(mark(z0)) → c15(S(z0))
Defined Rule Symbols:

proper

Defined Pair Symbols:

FROM, CONS, SEL, FIRST, S, TOP

Compound Symbols:

c4, c5, c6, c7, c8, c9, c10, c11, c12, c13, c14, c15, c1

(21) CdtRuleRemovalProof (UPPER BOUND(ADD(n^1)) transformation)

Found a reduction pair which oriented the following tuples strictly. Hence they can be removed from S.

FROM(mark(z0)) → c5(FROM(z0))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
FIRST(z0, mark(z1)) → c13(FIRST(z0, z1))
We considered the (Usable) Rules:none
And the Tuples:

FROM(ok(z0)) → c4(FROM(z0))
FROM(mark(z0)) → c5(FROM(z0))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
FIRST(ok(z0), ok(z1)) → c11(FIRST(z0, z1))
FIRST(mark(z0), z1) → c12(FIRST(z0, z1))
FIRST(z0, mark(z1)) → c13(FIRST(z0, z1))
S(ok(z0)) → c14(S(z0))
S(mark(z0)) → c15(S(z0))
TOP(mark(z0)) → c1(TOP(proper(z0)))
The order we found is given by the following interpretation:
Polynomial interpretation :

POL(0) = [1]   
POL(CONS(x1, x2)) = x1   
POL(FIRST(x1, x2)) = x2   
POL(FROM(x1)) = x1   
POL(S(x1)) = 0   
POL(SEL(x1, x2)) = x1   
POL(TOP(x1)) = 0   
POL(c1(x1)) = x1   
POL(c10(x1)) = x1   
POL(c11(x1)) = x1   
POL(c12(x1)) = x1   
POL(c13(x1)) = x1   
POL(c14(x1)) = x1   
POL(c15(x1)) = x1   
POL(c4(x1)) = x1   
POL(c5(x1)) = x1   
POL(c6(x1)) = x1   
POL(c7(x1)) = x1   
POL(c8(x1)) = x1   
POL(c9(x1)) = x1   
POL(mark(x1)) = [1] + x1   
POL(nil) = 0   
POL(ok(x1)) = x1   
POL(proper(x1)) = [1] + x1   

(22) Obligation:

Complexity Dependency Tuples Problem
Rules:

proper(nil) → ok(nil)
proper(0) → ok(0)
Tuples:

FROM(ok(z0)) → c4(FROM(z0))
FROM(mark(z0)) → c5(FROM(z0))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
FIRST(ok(z0), ok(z1)) → c11(FIRST(z0, z1))
FIRST(mark(z0), z1) → c12(FIRST(z0, z1))
FIRST(z0, mark(z1)) → c13(FIRST(z0, z1))
S(ok(z0)) → c14(S(z0))
S(mark(z0)) → c15(S(z0))
TOP(mark(z0)) → c1(TOP(proper(z0)))
S tuples:

FROM(ok(z0)) → c4(FROM(z0))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
FIRST(mark(z0), z1) → c12(FIRST(z0, z1))
K tuples:

FIRST(ok(z0), ok(z1)) → c11(FIRST(z0, z1))
S(ok(z0)) → c14(S(z0))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
TOP(mark(z0)) → c1(TOP(proper(z0)))
S(mark(z0)) → c15(S(z0))
FROM(mark(z0)) → c5(FROM(z0))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
FIRST(z0, mark(z1)) → c13(FIRST(z0, z1))
Defined Rule Symbols:

proper

Defined Pair Symbols:

FROM, CONS, SEL, FIRST, S, TOP

Compound Symbols:

c4, c5, c6, c7, c8, c9, c10, c11, c12, c13, c14, c15, c1

(23) CdtRuleRemovalProof (UPPER BOUND(ADD(n^1)) transformation)

Found a reduction pair which oriented the following tuples strictly. Hence they can be removed from S.

SEL(z0, mark(z1)) → c10(SEL(z0, z1))
We considered the (Usable) Rules:none
And the Tuples:

FROM(ok(z0)) → c4(FROM(z0))
FROM(mark(z0)) → c5(FROM(z0))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
FIRST(ok(z0), ok(z1)) → c11(FIRST(z0, z1))
FIRST(mark(z0), z1) → c12(FIRST(z0, z1))
FIRST(z0, mark(z1)) → c13(FIRST(z0, z1))
S(ok(z0)) → c14(S(z0))
S(mark(z0)) → c15(S(z0))
TOP(mark(z0)) → c1(TOP(proper(z0)))
The order we found is given by the following interpretation:
Polynomial interpretation :

POL(0) = 0   
POL(CONS(x1, x2)) = 0   
POL(FIRST(x1, x2)) = 0   
POL(FROM(x1)) = 0   
POL(S(x1)) = x1   
POL(SEL(x1, x2)) = x2   
POL(TOP(x1)) = 0   
POL(c1(x1)) = x1   
POL(c10(x1)) = x1   
POL(c11(x1)) = x1   
POL(c12(x1)) = x1   
POL(c13(x1)) = x1   
POL(c14(x1)) = x1   
POL(c15(x1)) = x1   
POL(c4(x1)) = x1   
POL(c5(x1)) = x1   
POL(c6(x1)) = x1   
POL(c7(x1)) = x1   
POL(c8(x1)) = x1   
POL(c9(x1)) = x1   
POL(mark(x1)) = [1] + x1   
POL(nil) = 0   
POL(ok(x1)) = x1   
POL(proper(x1)) = 0   

(24) Obligation:

Complexity Dependency Tuples Problem
Rules:

proper(nil) → ok(nil)
proper(0) → ok(0)
Tuples:

FROM(ok(z0)) → c4(FROM(z0))
FROM(mark(z0)) → c5(FROM(z0))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
FIRST(ok(z0), ok(z1)) → c11(FIRST(z0, z1))
FIRST(mark(z0), z1) → c12(FIRST(z0, z1))
FIRST(z0, mark(z1)) → c13(FIRST(z0, z1))
S(ok(z0)) → c14(S(z0))
S(mark(z0)) → c15(S(z0))
TOP(mark(z0)) → c1(TOP(proper(z0)))
S tuples:

FROM(ok(z0)) → c4(FROM(z0))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
FIRST(mark(z0), z1) → c12(FIRST(z0, z1))
K tuples:

FIRST(ok(z0), ok(z1)) → c11(FIRST(z0, z1))
S(ok(z0)) → c14(S(z0))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
TOP(mark(z0)) → c1(TOP(proper(z0)))
S(mark(z0)) → c15(S(z0))
FROM(mark(z0)) → c5(FROM(z0))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
FIRST(z0, mark(z1)) → c13(FIRST(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
Defined Rule Symbols:

proper

Defined Pair Symbols:

FROM, CONS, SEL, FIRST, S, TOP

Compound Symbols:

c4, c5, c6, c7, c8, c9, c10, c11, c12, c13, c14, c15, c1

(25) CdtRuleRemovalProof (UPPER BOUND(ADD(n^1)) transformation)

Found a reduction pair which oriented the following tuples strictly. Hence they can be removed from S.

CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
We considered the (Usable) Rules:none
And the Tuples:

FROM(ok(z0)) → c4(FROM(z0))
FROM(mark(z0)) → c5(FROM(z0))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
FIRST(ok(z0), ok(z1)) → c11(FIRST(z0, z1))
FIRST(mark(z0), z1) → c12(FIRST(z0, z1))
FIRST(z0, mark(z1)) → c13(FIRST(z0, z1))
S(ok(z0)) → c14(S(z0))
S(mark(z0)) → c15(S(z0))
TOP(mark(z0)) → c1(TOP(proper(z0)))
The order we found is given by the following interpretation:
Polynomial interpretation :

POL(0) = [2]   
POL(CONS(x1, x2)) = [3]x2   
POL(FIRST(x1, x2)) = 0   
POL(FROM(x1)) = 0   
POL(S(x1)) = 0   
POL(SEL(x1, x2)) = 0   
POL(TOP(x1)) = 0   
POL(c1(x1)) = x1   
POL(c10(x1)) = x1   
POL(c11(x1)) = x1   
POL(c12(x1)) = x1   
POL(c13(x1)) = x1   
POL(c14(x1)) = x1   
POL(c15(x1)) = x1   
POL(c4(x1)) = x1   
POL(c5(x1)) = x1   
POL(c6(x1)) = x1   
POL(c7(x1)) = x1   
POL(c8(x1)) = x1   
POL(c9(x1)) = x1   
POL(mark(x1)) = 0   
POL(nil) = [3]   
POL(ok(x1)) = [3] + x1   
POL(proper(x1)) = [2] + [2]x1   

(26) Obligation:

Complexity Dependency Tuples Problem
Rules:

proper(nil) → ok(nil)
proper(0) → ok(0)
Tuples:

FROM(ok(z0)) → c4(FROM(z0))
FROM(mark(z0)) → c5(FROM(z0))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
FIRST(ok(z0), ok(z1)) → c11(FIRST(z0, z1))
FIRST(mark(z0), z1) → c12(FIRST(z0, z1))
FIRST(z0, mark(z1)) → c13(FIRST(z0, z1))
S(ok(z0)) → c14(S(z0))
S(mark(z0)) → c15(S(z0))
TOP(mark(z0)) → c1(TOP(proper(z0)))
S tuples:

FROM(ok(z0)) → c4(FROM(z0))
FIRST(mark(z0), z1) → c12(FIRST(z0, z1))
K tuples:

FIRST(ok(z0), ok(z1)) → c11(FIRST(z0, z1))
S(ok(z0)) → c14(S(z0))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
TOP(mark(z0)) → c1(TOP(proper(z0)))
S(mark(z0)) → c15(S(z0))
FROM(mark(z0)) → c5(FROM(z0))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
FIRST(z0, mark(z1)) → c13(FIRST(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
Defined Rule Symbols:

proper

Defined Pair Symbols:

FROM, CONS, SEL, FIRST, S, TOP

Compound Symbols:

c4, c5, c6, c7, c8, c9, c10, c11, c12, c13, c14, c15, c1

(27) CdtRuleRemovalProof (UPPER BOUND(ADD(n^1)) transformation)

Found a reduction pair which oriented the following tuples strictly. Hence they can be removed from S.

FIRST(mark(z0), z1) → c12(FIRST(z0, z1))
We considered the (Usable) Rules:none
And the Tuples:

FROM(ok(z0)) → c4(FROM(z0))
FROM(mark(z0)) → c5(FROM(z0))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
FIRST(ok(z0), ok(z1)) → c11(FIRST(z0, z1))
FIRST(mark(z0), z1) → c12(FIRST(z0, z1))
FIRST(z0, mark(z1)) → c13(FIRST(z0, z1))
S(ok(z0)) → c14(S(z0))
S(mark(z0)) → c15(S(z0))
TOP(mark(z0)) → c1(TOP(proper(z0)))
The order we found is given by the following interpretation:
Polynomial interpretation :

POL(0) = 0   
POL(CONS(x1, x2)) = x2   
POL(FIRST(x1, x2)) = x1   
POL(FROM(x1)) = 0   
POL(S(x1)) = 0   
POL(SEL(x1, x2)) = 0   
POL(TOP(x1)) = 0   
POL(c1(x1)) = x1   
POL(c10(x1)) = x1   
POL(c11(x1)) = x1   
POL(c12(x1)) = x1   
POL(c13(x1)) = x1   
POL(c14(x1)) = x1   
POL(c15(x1)) = x1   
POL(c4(x1)) = x1   
POL(c5(x1)) = x1   
POL(c6(x1)) = x1   
POL(c7(x1)) = x1   
POL(c8(x1)) = x1   
POL(c9(x1)) = x1   
POL(mark(x1)) = [1] + x1   
POL(nil) = 0   
POL(ok(x1)) = x1   
POL(proper(x1)) = 0   

(28) Obligation:

Complexity Dependency Tuples Problem
Rules:

proper(nil) → ok(nil)
proper(0) → ok(0)
Tuples:

FROM(ok(z0)) → c4(FROM(z0))
FROM(mark(z0)) → c5(FROM(z0))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
FIRST(ok(z0), ok(z1)) → c11(FIRST(z0, z1))
FIRST(mark(z0), z1) → c12(FIRST(z0, z1))
FIRST(z0, mark(z1)) → c13(FIRST(z0, z1))
S(ok(z0)) → c14(S(z0))
S(mark(z0)) → c15(S(z0))
TOP(mark(z0)) → c1(TOP(proper(z0)))
S tuples:

FROM(ok(z0)) → c4(FROM(z0))
K tuples:

FIRST(ok(z0), ok(z1)) → c11(FIRST(z0, z1))
S(ok(z0)) → c14(S(z0))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
TOP(mark(z0)) → c1(TOP(proper(z0)))
S(mark(z0)) → c15(S(z0))
FROM(mark(z0)) → c5(FROM(z0))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
FIRST(z0, mark(z1)) → c13(FIRST(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
FIRST(mark(z0), z1) → c12(FIRST(z0, z1))
Defined Rule Symbols:

proper

Defined Pair Symbols:

FROM, CONS, SEL, FIRST, S, TOP

Compound Symbols:

c4, c5, c6, c7, c8, c9, c10, c11, c12, c13, c14, c15, c1

(29) CdtRuleRemovalProof (UPPER BOUND(ADD(n^1)) transformation)

Found a reduction pair which oriented the following tuples strictly. Hence they can be removed from S.

FROM(ok(z0)) → c4(FROM(z0))
We considered the (Usable) Rules:none
And the Tuples:

FROM(ok(z0)) → c4(FROM(z0))
FROM(mark(z0)) → c5(FROM(z0))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
FIRST(ok(z0), ok(z1)) → c11(FIRST(z0, z1))
FIRST(mark(z0), z1) → c12(FIRST(z0, z1))
FIRST(z0, mark(z1)) → c13(FIRST(z0, z1))
S(ok(z0)) → c14(S(z0))
S(mark(z0)) → c15(S(z0))
TOP(mark(z0)) → c1(TOP(proper(z0)))
The order we found is given by the following interpretation:
Polynomial interpretation :

POL(0) = 0   
POL(CONS(x1, x2)) = 0   
POL(FIRST(x1, x2)) = [2]x1   
POL(FROM(x1)) = x1   
POL(S(x1)) = 0   
POL(SEL(x1, x2)) = 0   
POL(TOP(x1)) = 0   
POL(c1(x1)) = x1   
POL(c10(x1)) = x1   
POL(c11(x1)) = x1   
POL(c12(x1)) = x1   
POL(c13(x1)) = x1   
POL(c14(x1)) = x1   
POL(c15(x1)) = x1   
POL(c4(x1)) = x1   
POL(c5(x1)) = x1   
POL(c6(x1)) = x1   
POL(c7(x1)) = x1   
POL(c8(x1)) = x1   
POL(c9(x1)) = x1   
POL(mark(x1)) = x1   
POL(nil) = 0   
POL(ok(x1)) = [2] + x1   
POL(proper(x1)) = 0   

(30) Obligation:

Complexity Dependency Tuples Problem
Rules:

proper(nil) → ok(nil)
proper(0) → ok(0)
Tuples:

FROM(ok(z0)) → c4(FROM(z0))
FROM(mark(z0)) → c5(FROM(z0))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
FIRST(ok(z0), ok(z1)) → c11(FIRST(z0, z1))
FIRST(mark(z0), z1) → c12(FIRST(z0, z1))
FIRST(z0, mark(z1)) → c13(FIRST(z0, z1))
S(ok(z0)) → c14(S(z0))
S(mark(z0)) → c15(S(z0))
TOP(mark(z0)) → c1(TOP(proper(z0)))
S tuples:none
K tuples:

FIRST(ok(z0), ok(z1)) → c11(FIRST(z0, z1))
S(ok(z0)) → c14(S(z0))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
TOP(mark(z0)) → c1(TOP(proper(z0)))
S(mark(z0)) → c15(S(z0))
FROM(mark(z0)) → c5(FROM(z0))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
FIRST(z0, mark(z1)) → c13(FIRST(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
FIRST(mark(z0), z1) → c12(FIRST(z0, z1))
FROM(ok(z0)) → c4(FROM(z0))
Defined Rule Symbols:

proper

Defined Pair Symbols:

FROM, CONS, SEL, FIRST, S, TOP

Compound Symbols:

c4, c5, c6, c7, c8, c9, c10, c11, c12, c13, c14, c15, c1

(31) SIsEmptyProof (BOTH BOUNDS(ID, ID) transformation)

The set S is empty

(32) BOUNDS(1, 1)